Normal Binary Graph Models

نویسنده

  • SETH SULLIVANT
چکیده

We show that the marginal semigroup of a binary graph model is normal if and only if the graph is free of K4 minors. The technique, based on the interplay of normality and the geometry of the marginal cone, has potential applications to other normality questions in algebraic statistics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Analysis of Bayesian Probit Regression of Binary and Polychotomous Response Data

The goal of this study is to introduce a statistical method regarding the analysis of specific latent data for regression analysis of the discrete data and to build a relation between a probit regression model (related to the discrete response) and normal linear regression model (related to the latent data of continuous response). This method provides precise inferences on binary and multinomia...

متن کامل

Estimation of Binary Infinite Dilute Diffusion Coefficient Using Artificial Neural Network

In this study, the use of the three-layer feed forward neural network has been investigated for estimating of infinite dilute diffusion coefficient ( D12 ) of supercritical fluid (SCF), liquid and gas binary systems. Infinite dilute diffusion coefficient was spotted as a function of critical temperature, critical pressure, critical volume, normal boiling point, molecular volume in normal boilin...

متن کامل

Bayesian model determination for multivariate ordinal and binary data

We consider how to compare different conditional independence specifications for ordinal categorical data, by calculating a posterior distribution over classes of graphical models. The approach is based on the multivariate ordinal probit model (Chib and Greenberg, 1998) where the data are considered to have arisen as truncated multivariate normal random vectors. By parameterising the precision ...

متن کامل

A comparison of a Gaussian and a binary ancestral graph model

For an ancestral graph with four vertices, we show that the associated binary model exhibits different properties than the previously studied Gaussian analog. The Gaussian likelihood function may be multimodal, whereas the likelihood function of the binary model is guaranteed to be unimodal. Canonical hidden variable models associated with ancestral graph models impose additional polynomial con...

متن کامل

Logical and Algorithmic Properties of Conditional Independence and Graphical Models

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Institute of Mathematical Statistics is collaborating with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009